Proposed CG method to solve unconstrained optimization problems
نویسندگان
چکیده
منابع مشابه
The Algorithms of Broyden-CG for Unconstrained Optimization Problems
The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Therefore, in this paper, the new hybrid 2592 Mohd Asrul Hery Ibrahim et al. method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested....
متن کاملProblems of Unconstrained Optimization
In this paper we give an review on convergence problems of un-constrained optimization algorithms, including line search algorithms and trust region algorithms. Recent results on convergence of conjugate gradient methods are discussed. Some well-known convergence problems of variable metric methods and recent eeorts made on these problems are also presented.
متن کاملA Non-Monotone Tensor Method for Unconstrained Optimization Problems
The tensor method for unconstrained optimization was first introduced by Schnable and Chow [SIAM Journal on Optimization, 1 (1991): 293–315], where each iteration bases upon a fourth order model for the objective function. In this paper, we propose a tensor method with a non-monotone line search scheme for solving the unconstrained optimization problem, and show the convergence of the method. W...
متن کاملA Conjugate Gradient Method for Unconstrained Optimization Problems
A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the parameter σ < 1. Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-...
متن کاملNew Variants of Newton's Method for Nonlinear Unconstrained Optimization Problems
In this paper, we propose new variants of Newton’s method based on quadrature formula and power mean for solving nonlinear unconstrained optimization problems. It is proved that the order of convergence of the proposed family is three. Numerical comparisons are made to show the performance of the presented methods. Furthermore, numerical experiments demonstrate that the logarithmic mean Newton’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1804/1/012024